Analysis of Vulnerability of Road Networks on the Basis of Graph Topology and Related Attribute Information
نویسنده
چکیده
The safety of people and the security of the vital functions of society are among the core tasks of governments. Various networks, especially transportation networks, are important for human life. Much research has been done to analyse the vulnerability of road networks and most of the methods were based on analysing the topological structure of the network using graph theory. For instance, Demšar et al. presented a mathematical method for modelling the vulnerability of the elements of the network, which can be used for the identification of critical locations in a spatial network. The vertices of the line graph that correspond to critical locations have one or more of the following three properties: they are cut vertices and they have a high betweenness value or a low clustering coefficient. The risk value estimation method produced results with low accuracy because the risk value of a cut edge road is estimated on the basis of its cut edge attribute value only (Demšar et al., 2008). However, it is not always sufficient to base network vulnerability analysis only on the topological structure for crisis management. For instance, in a road network, if a bridge to an island can be considered as a cut edge, what if there is only one summer house on the island? Is this bridge more important than a minor road located inside a residential area with a high population density? If edge A has a higher betweenness centrality value than cut edge B, is edge A more vulnerable than edge B? Obviously, some non-topological attributes should also be added into consideration when analyzing the vulnerability of road network for the preparedness of crisis management. This paper introduces a multi-attribute value theory that could be used to extend the graph theory approach towards a more complementary method.
منابع مشابه
A Survey On the Vulnerability Parameters of Networks
The analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. One is naturally interested in studying the types of disruption in the network that maybe caused by failures of certain links or nodes. In terms of a graph, the concept of connectedness is used in dierent forms to study many of the measures of vulnerability. When certain vert...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملVULNERABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS: GRAPH THEORY METHOD
The main functional purpose of a water distribution network is to transport water from a source to several domestic and industrial units while at the same time satisfying various requirements on hydraulic response. All the water distribution networks perform two basic operations: firstly the water network needs to deliver adequate amounts of water to meet specific requirements, and secondly the...
متن کاملTowards a measure of vulnerability, tenacity of a Graph
If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...
متن کاملOmega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
متن کامل